https://leetcode.cn/problems/max-consecutive-ones/description/
//
int findMaxConsecutiveOnes(int* nums, int numsSize) {
    int ret = 0;
    int tmp = 0;
    for (int i = 0;i < numsSize;i++)
    {
        if (nums[i] == 1)
        {
            tmp++;
            if (tmp > ret)
            {
                ret = tmp;
            }
        }
        else
        {
            tmp = 0;
        }

    }
    return ret;
}